GR(1)*: GR(1) specifications extended with existential guarantees

Abstract Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from its temporal logic specification. GR(1) expressive assume-guarantee fragment of LTL that enables efficient and has been recently used in different contexts application domains. A common form providing system's requirements through use cases, which are existential nature. However, GR(1), as LTL, limited universal properties. In this paper we introduce GR(1)*, extends with guarantees. We show GR(1)* strictly more than it the expression guarantees inexpressible LTL. solve realizability problem for present symbolic strategy construction algorithm specifications. Importantly, comparison remains efficient: time complexity our checking procedures identical known corresponding GR(1).